Automatic Proof of Graph Nonisomorphism
نویسندگان
چکیده
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental implementation of an interactive webpage producing a proof of (non)isomorphism when given two graphs. Mathematics Subject Classification (2000). 05C60, 68R10, 05C25, 03B35.
منابع مشابه
Proofs that Yield Nothing But Their Validity All Languages in NP Have Zero-Knowledge Proof Systems
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without conveying any additional knowledge. All previously known zero-knowledge proofs were only for number-theo...
متن کاملTwin bent functions, strongly regular Cayley graphs, and Hurwitz-Radon theory
The real monomial representations of Clifford algebras give rise to two sequences of bent functions. For each of these sequences, the corresponding Cayley graphs are strongly regular graphs, and the corresponding sequences of strongly regular graph parameters coincide. Even so, the corresponding graphs in the two sequences are not isomorphic, except in the first 3 cases. The proof of this nonis...
متن کاملDerandomizing Arthur-Merlin Games
We establish hardness versus randomness trade-oos for Arthur-Merlin games. We create eecient nondeterministic simulations of bounded round Arthur-Merlin games, using a language in exponential time which small circuits cannot decide given access to an oracle for satissability. Our results yield subexponential size proofs for graph nonisomorphism at innnitely many lengths unless the polynomial-ti...
متن کاملOn an optimal randomized acceptor for graph nonisomorphism
An acceptor for a language L is an algorithm that accepts every input in L and does not stop on every input not in L. An acceptor Opt for a language L is called optimal if for every acceptor A for this language there exists polynomial pA such that for every x ∈ L, the running time timeOpt(x) of Opt on x is bounded by pA(timeA(x) + |x|) for every x ∈ L. (Note that the comparison of the running t...
متن کاملCPT Notes, Graph Non-Isomorphism, Zero-Knowledge for NP and Exercises
We look at the problem of graph nonisomorphism. In this protocol, P is trying to convince V that two graphs G0 and G1 are not isomorphic. We will prove that the protocol below is perfect zero-knowledge. We assume that the graphs have the same number n of vertices and the same number of edges (otherwise the protocol is not very interesting!). Let B = {0, 1}. For a graph G with n vertices, making...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics in Computer Science
دوره 2 شماره
صفحات -
تاریخ انتشار 2008